Lapack Working Note 167: Subset Computations with the Mrrr Algorithm
نویسندگان
چکیده
Abstract. The main advantage of inverse iteration over the QR algorithm and Divide & Conquer for the symmetric tridiagonal eigenproblem is that subsets of eigenpairs can be computed at reduced cost. The MRRR algorithm (MRRR = Multiple Relatively Robust Representations) is a clever variant of inverse iteration without the need for reorthogonalization. stegr, the current version of MRRR in LAPACK 3.0, does not allow for subset computations. The next release of stegr is designed to compute a (sub-)set of k eigenpairs with O(kn) operations. Because of the special way in which eigenvectors are computed, MRRR subset computations are more complicated than when using inverse iteration. Unlike the latter, MRRR sometimes cannot ignore the unwanted part of the spectrum. We describe the problems with what we call ’false singletons’. These are eigenvalues that appear to be isolated with respect to the wanted eigenvalues but in fact belong to a tight cluster of unwanted eigenvalues. This paper analyzes these complications and ways to deal with them.
منابع مشابه
Computations of eigenpair subsets with the MRRR algorithm
The main advantage of inverse iteration over the QR algorithm and Divide & Conquer for the symmetric tridiagonal eigenproblem is that subsets of eigenpairs can be computed at reduced cost. The MRRR algorithm (MRRR = Multiple Relatively Robust Representations) is a clever variant of inverse iteration without the need for reorthogonalization. stegr, the current version of MRRR in LAPACK 3.0, does...
متن کاملLapack Working Note 195: Scalapack’s Mrrr Algorithm
The sequential algorithm of Multiple Relatively Robust Representations, MRRR, can compute numerically orthogonal eigenvectors of an unreduced symmetric tridiagonal matrix T ∈ R with O(n) cost. This paper describes the design of ScaLAPACK’s parallel MRRR algorithm. One emphasis is on the critical role of the representation tree in achieving both numerical accuracy and parallel scalability. A sec...
متن کاملLapack Working Note 194: a Refined Representation Tree for Mrrr
In order to compute orthogonal eigenvectors of a symmetric tridiagonal matrix without Gram-Schmidt orthogonalization, the MRRR algorithm finds a shifted LDL factorization (representation) for each eigenvalue such that the local eigenvalue is a singleton, that is defined to high relative accuracy and has a large relative gap. MRRR’s representation tree describes how, by successive shifting and r...
متن کاملGlued Matrices and the MRRR Algorithm
During the last ten years, Dhillon and Parlett devised a new algorithm (multiple relatively robust representations (MRRR)) for computing numerically orthogonal eigenvectors of a symmetric tridiagonal matrix T with O(n2) cost. It has been incorporated into LAPACK version 3.0 as routine stegr. We have discovered that the MRRR algorithm can fail in extreme cases. Sometimes eigenvalues agree to wor...
متن کاملLapack Working Note 166: Computing the Bidiagonal Svd Using Multiple Relatively Robust Representations
We describe the design and implementation of a new algorithm for computing the singular value decomposition of a real bidiagonal matrix. This algorithm uses ideas developed by Großer and Lang that extend Parlett’s and Dhillon’s MRRR algorithm for the tridiagonal symmetric eigenproblem. One key feature of our new implementation is, that k singular triplets can be computed using only O(nk) storag...
متن کامل